Principal Type Schemes for the Strict Type Assignment System
نویسنده
چکیده
We study the strict type assignment system, a restriction of the intersection type discipline [6], and prove that it has the principal type property. We define, for a term M, the principal pair (of basis and type). We specify three operations on pairs, and prove that all pairs deducible for M can be obtained from the principal one by these operations, and that these map deducible pairs to deducible pairs. Lambda Calculus, type assignment systems, principal type scheme, intersection types, approximate normal forms
منابع مشابه
New Shewhart-type synthetic bar{X} control schemes for non-normal data
In this paper, Burr-type XII ̄X synthetic schemes are proposed as an alternative to the classical ̄X synthetic schemes when the assumption of normality fails to hold. First, the basic design of the Burr-type XII ̄X synthetic scheme is developed and its performance investigated using exact formulae. Secondly, the non-side-sensitive and side-sensitive Burr-type XII ̄X synthetic schemes are int...
متن کاملComplete Restrictions of the Intersection Type Discipline
In this paper the intersection type discipline as defined in [Barendregt et al. ’83] is studied. We will present two different and independent complete restrictions of the intersection type discipline. The first restricted system, the strict type assignment system, is presented in section two. Its major feature is the absence of the derivation rule (≤) and it is based on a set of strict types. ...
متن کاملPrincipal typing schemes in a polyadic - calculus
The present paper introduces a typing system for a version of Milner's polyadic calculus, and a typing inference algorithm linear on the size of the input. The central concept underlying the typing system is the notion of type assignment, where each free name in a term is assigned a type, the term itself being given multiple nametype pairs. This observation leads to a clean typing system for Mi...
متن کاملStrict fixed points of '{C}iri'{c}-generalized weak quasicontractive multi-valued mappings of integral type
Many authors such as Amini-Harandi, Rezapour et al., Kadelburg et al., have tried to find at least one fixed point for quasi-contractions when $alphain[frac{1}{2}, 1)$ but no clear answer exists right now and many of them either have failed or changed to a lighter version. In this paper, we introduce some new strict fixed point results in the set of multi-valued '{C}iri'{c}-gener...
متن کاملCut-elimination in the Strict Intersection Type Assignment System Is Strongly Normalising
This paper defines reduction on derivations in the strict intersection type assignment system of [1], by generalising cut-elimination, and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability using intersection types.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 3 شماره
صفحات -
تاریخ انتشار 1993